Performance Comparison of Four Unicast Routing Schemes in DTNs
نویسندگان
چکیده
Disruption tolerant network(DTN)s have been proposed to provide data communications in challenging network scenarios where an instantaneous end-to-end path between a source and destination may not exist. In this paper, we focus on comparing the performance of four recently proposed unicast routing schemes, namely (i) Multihop Routing with Custody Transfer (MRCT), (ii) Two-Hop Relay with Erasure-Coding (THEC), (iii) MaxProp, and (iv) Prophet. We conduct performance studies for different DTN scenarios, e.g., DTNs with different node densities, DTNs with different mobility models, networks with different percentage of nodes supporting DTN functionality, etc. Our results indicate that (i) the custody transfer concept significantly improves the delivery ratio in a sparsely connected network for all four schemes, (ii) multihop routing approach achieves higher delivery ratio with lower message delivery latency than the two-hop routing approach but incurs higher transmission overhead, (iii) MRCT scheme provides the best delivery performance by achieving high delivery ratio and low average delay, (iv) both MRCT and THEC schemes perform better with Zebranet than with the random waypoint (RWP) mobility model but MaxProp and Prophet performs worse with Zebranet than with the RWP model, (v) among the three multihop schemes, the transmission overhead for MaxProp and Prophet is higher than that incurred using the MRCT scheme. All these four schemes do not perform well when the network is very sparse (when each node has fewer than 1.5 neighbors within its transmission range) and hence an adaptive scheme that allows nodes to act as message ferries when its local neighborhood is very sparse is needed for such scenarios.
منابع مشابه
Performance Comparison of Unicast Routing Schemes in DTNs
Delay and disruption tolerant network(DTN)s have been proposed to address data communication challenges in network scenarios where an instantaneous end-to-end path between a source and destination may not exist, and the links between nodes may be opportunistic, predictably connectable, or periodically-(dis)connected. In this paper, we focus on comparing the performance of different proposed uni...
متن کاملAn encounter-based multicast scheme for disruption tolerant networks
Some ad hoc network scenarios are characterized by frequent partitions and intermittent connectivity. Hence, existing ad hoc routing schemes that assume that an end-to-end path exists from a source to a destination do not work in such challenging environment. A store-and-forward network architecture known as the disruption tolerant network (DTN) has been designed for such challenging network en...
متن کاملPerformance comparison of different multicast routing strategies in disruption tolerant networks
Disruption Tolerant Networks (DTNs) technologies are emerging solutions to networks that experience frequent partitions. As a result, multicast design for DTNs is a considerably more difficult problem compared to that of Internet and mobile ad hoc networks. In this paper, we first investigate three basic DTN multicast strategies, including unicast-based multicast (U-Multicast), static-tree-base...
متن کاملMinimum Expected *-Cast Time in DTNs
Delay Tolerant Networks (DTNs) are wireless networks in which end-to-end connectivity is sporadic. Routing in DTNs uses past connectivity information to predict future node meeting opportunities. Recent research efforts consider the use of social network analysis (i.e., node communities, centralities etc.) for this forecast. However, most of these works focus on unicast. We believe that group c...
متن کاملAnalytical Techniques for Performance Analysis of Multi-copy Routing Schemes in Delay Tolerant Networks
Delay tolerant networks (DTNs) are a class of networks that experience frequent and long-duration partitions due to sparse distribution of nodes. The topological impairments experienced within a DTN pose unique challenges for designing effective DTN multicasting protocols. In this paper, we examine multi-copy routing schemes for DTNs. We provide analysis of multi-copy routing schemes by derivin...
متن کامل